R/BHC: fast Bayesian hierarchical clustering for microarray data
نویسندگان
چکیده
منابع مشابه
Randomized Algorithms for Fast Bayesian Hierarchical Clustering
We present two new algorithms for fast Bayesian Hierarchical Clustering on large data sets. Bayesian Hierarchical Clustering (BHC) [1] is a method for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. BHC has several advantages over traditional distancebased agglomerative clustering algorithms. It defines a probabilistic model of the data a...
متن کاملHIERARCHICAL DATA CLUSTERING MODEL FOR ANALYZING PASSENGERS’ TRIP IN HIGHWAYS
One of the most important issues in urban planning is developing sustainable public transportation. The basic condition for this purpose is analyzing current condition especially based on data. Data mining is a set of new techniques that are beyond statistical data analyzing. Clustering techniques is a subset of it that one of it’s techniques used for analyzing passengers’ trip. The result of...
متن کاملBayesian Functional Data Clustering for Temporal Microarray Data
We propose a Bayesian procedure to cluster temporal gene expression microarray profiles, based on a mixed-effect smoothing-spline model, and design a Gibbs sampler to sample from the desired posterior distribution. Our method can determine the cluster number automatically based on the Bayesian information criterion, and handle missing data easily. When applied to a microarray dataset on the bud...
متن کاملhierarchical data clustering model for analyzing passengers’ trip in highways
one of the most important issues in urban planning is developing sustainable public transportation. the basic condition for this purpose is analyzing current condition especially based on data. data mining is a set of new techniques that are beyond statistical data analyzing. clustering techniques is a subset of it that one of it’s techniques used for analyzing passengers’ trip. the result of t...
متن کاملBayesian Hierarchical Cross-Clustering
Most clustering algorithms assume that all dimensions of the data can be described by a single structure. Cross-clustering (or multiview clustering) allows multiple structures, each applying to a subset of the dimensions. We present a novel approach to crossclustering, based on approximating the solution to a Cross Dirichlet Process mixture (CDPM) model [Shafto et al., 2006, Mansinghka et al., ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Bioinformatics
سال: 2009
ISSN: 1471-2105
DOI: 10.1186/1471-2105-10-242